Compact covering and game determinacy
نویسندگان
چکیده
منابع مشابه
Covering compact metric spaces greedily
Abstract. A general greedy approach to construct coverings of compact metric spaces by metric balls is given and analyzed. The analysis is a continuous version of Chvátal’s analysis of the greedy algorithm for the weighted set cover problem. The approach is demonstrated in an exemplary manner to construct efficient coverings of the n-dimensional sphere and n-dimensional Euclidean space to give ...
متن کاملDeterminacy and determinacy analysis
One attractive, unique feature of logic programming languages is their ability to succinctly and declaratively express search. The alternatives of a search can be speci ed by a set of clauses de ning the same predicate. By backtracking, considering in turn each of these clauses, the di erent alternatives are explored until a solution (if it exists) is found. However, though backtracking is esse...
متن کاملThe Hat Game and covering codes
The Hat Game (Ebert’s Hat Problem) got much attention in the beginning of this century; not in the last place by its connections to coding theory and computer science. There were publications in The New York Times, Die Zeit and abcNews. Exact solutions with two colors are only known in the symmetric case (equal probabilities for the two colors) when = 2 − 1 (using Hamming codes), = 2 (extended ...
متن کاملSprouts Game on Compact Surfaces
Sprouts is a two-player topological game, invented in 1967 by Michael Paterson and John Conway. The game starts with p spots drawn on a sheet of paper, and lasts at most 3p − 1 moves : the player who makes the last move wins. Sprouts is a very intricate game and the best known manual analysis only achieved to find a winning strategy up to p = 7 spots. Recent computer analysis reached up to p = ...
متن کاملCompact Game Representations: Reasoning and Computation
A proliferation of compact representation schemes have been been proposed for various classes of games, along with efficient computations of solution concepts on such representations. The two main schemes have been Graphical games [7] and Multi-agent Influence Diagrams [14]. However, various other representations exist such as Game Networks [13] and Action-Graph Games [2]. This work will presen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 1996
ISSN: 0166-8641
DOI: 10.1016/0166-8641(95)00058-5